Positive maps and trace polynomials from the symmetric group

نویسندگان

چکیده

With techniques borrowed from quantum information theory, we develop a method to systematically obtain operator inequalities and identities in several matrix variables. These take the form of trace polynomials: polynomial-like expressions that involve monomials Xα1,…,Xαr their traces tr(Xα1,…,Xαr). Our rests on translating action symmetric group tensor product spaces into multiplication. As result, extend polarized Cayley–Hamilton identity an inequality positive cone, characterize set multilinear equivariant maps terms Werner state witnesses, construct permutation polynomials polynomial spaces. We give connections concepts theory invariant theory.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symmetric, Positive Semidefinite Polynomials Which

This paper presents a construction for symmetric, non-negative polynomials, which are not sums of squares. It explicitly generalizes the Motzkin polynomial and the Robinson polynomials to families of non-negative polynomials, which are not sums of squares. The degrees of the resulting polynomials can be chosen in advance. 2000 Mathematics Subject Classification: 12Y05, 20C30, 12D10, 26C10, 12E10

متن کامل

Singular polynomials for the symmetric group and Krawtchouk polynomials

A singular polynomial is one which is annihilated by all Dunkl operators for a certain parameter value. These polynomials were first studied by Dunkl, de Jeu and Opdam, (Trans. Amer. Math. Soc. 346 (1994), 237-256). This paper constructs a family of such polynomials associated to the irreducible representation (N − 2, 1, 1) of the symmetric group SN for odd N and parameter values − 1 2 ,− 3 2 ,...

متن کامل

Chromatic Polynomials and Representations of the Symmetric Group

The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a graph G when k colours are available. The fact that it is a polynomial function of k is essentially a consequence of the fact that, when k exceeds the number of vertices of G, not all the colours can be used. Another quite trivial property of the construction is that the names of the k colours are im...

متن کامل

Stanley’s character polynomials and coloured factorizations in the symmetric group

In Stanley [8], the author introduces polynomials which help evaluate symmetric group characters and conjectures that the coefficients of the polynomials are positive. In [9], the same author gives a conjectured combinatorial interpretation for the coefficients of the polynomials. Here, we prove the conjecture for the terms of highest degree.

متن کامل

Stanley's character polynomials and coloured factorisations in the symmetric group

In Stanley [8] the author introduces polynomials which help evaluate symmetric group characters and conjectures that the coefficients of the polynomials are positive. In [9] the same author gives a conjectured combinatorial interpretation for the coefficients of the polynomials. Here, we prove the conjecture for the terms of highest degree.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Physics

سال: 2021

ISSN: ['0022-2488', '1527-2427', '1089-7658']

DOI: https://doi.org/10.1063/5.0028856